Combinatorial identities associated with CFTP
نویسندگان
چکیده
We explore a method of obtaining combinatorial identities by analysing partially-completed runs of the Coupling from the Past (CFTP) algorithm. In particular, using CFTP for simple symmetric random walk (ssrw) with holding boundaries, we derive an identity involving linear combinations of Cab(s) for different a and b, where Cab(s) is the probability that unconstrained ssrw run from 0 for time n has maximum value a, and minimum value b, and ends up at s at time n.
منابع مشابه
Combinatorial Proofs of Identities in Ramanujan’s Lost Notebook Associated with the Rogers–fine Identity and False Theta Functions
Ramanujan’s lost notebook contains several identities arising from the Rogers–Fine identity and/or Rogers’ false theta functions. Combinatorial proofs for many of these identities are given.
متن کاملOn Series Expansions of Capparelli’s Infinite Product
Using Lie theory, Stefano Capparelli conjectured an interesting Rogers-Ramanujan type partition identity in his 1988 Rutgers Ph.D. thesis. The first proof was given by George Andrews, using combinatorial methods. Later, Capparelli was able to provide a Lie theoretic proof. Most combinatorial Rogers-Ramanujan type identities (e.g. the Göllnitz-Gordon identities, Gordon’s combinatorial generaliza...
متن کاملCard Deals, Lattice Paths, Abelian Words and Combinatorial Identities
We give combinatorial interpretations of several related identities associated with the names Barrucand, Strehl and Franel, including one for the Apéry numbers, ∑n k=0 (n k )(n+k k ) ∑k j=0 (k j 3 = ∑n k=0 (n k )2(n+k k 2 . The combinatorial constructs employed are derangement-type card deals as introduced in a previous paper on Barrucand’s identity, labeled lattice paths and, following a comme...
متن کاملCombinatorial Proofs of q-Series Identities
We provide combinatorial proofs of six of the ten q-series identities listed in [3, Theorem 3]. Andrews, Jiménez-Urroz and Ono prove these identities using formal manipulation of identities arising in the theory of basic hypergeometric series. Our proofs are purely combinatorial, based on interpreting both sides of the identities as generating functions for certain partitions. One of these iden...
متن کاملCoupling from the past times with Ambiguities and Perturbations of Interacting Particle Systems
We discuss coupling from the past techniques (CFTP) for perturbations of interacting particle systems on Z with a finite set of states, within the framework of the graphical construction of the dynamics based on Poisson processes. We first develop general results for what we call CFTP times with ambiguities. These are analogous to classical coupling (from the past) times, except that the coupli...
متن کامل